Pii: S0004-3702(98)00109-x

Expressiveness of Concept Expressions in First-Order Description Logics

We introduce a method for characterizing the expressive power of concept expressions in rst-order description logics. The method is essentially model-theoretic in nature in that it gives preservation results uniquely identifying a wide range of description logics as fragments of rst-order logic. The languages studied in the paper all belong to the well-known FL and AL hierarchies.

On the complexity of inference about probabilistic relational models

Top-Down Induction of First-Order Logical Decision Trees

Applications of the Situation Calculus To Formalizing Control and Strategy Information: The Prolog Cut Operator

We argue that the situation calculus is a natural formalism for representing and reasoning about control and strategic information. As a case study, in this paper we provide a situation calculus semantics for the Prolog cut operator, the central search control operator in Prolog. We show that our semantics is well-behaved when the programs are properly stratif ied. We also show that according t...

Sokoban: Enhancing general single-agent search methods using domain knowledge

Artificial intelligence (AI) research has developed an extensive collection of methods to solve state-space problems. Using the challenging domain of Sokoban, this paper studies the effect of general search enhancements on program performance. We show that the current state of the art in AI generally requires a large research and programming effort to use domain-dependent knowledge to solve eve...